Regular low-density parity-check codes from combinatorial designs
نویسندگان
چکیده
Analytically constructed LDPC codes comprise only a very small subset of possible codes and as a result LDPC codes are still, for the most part, constructed randomly. This paper extends the class of LDPC codes that can be systematically generated by presenting a construction method for regular LDPC codes based on combinatorial designs known as Kirkman triple systems. We construct -codes whose Tanner graph is free of -cycles for any value of divisible by , and examine girth and minimum distance properties of several classes of LDPC codes obtained from combinatorial designs.
منابع مشابه
Regular low-density parity-check codes from oval designs
This paper presents a construction of low-density parity-check (LDPC) codes based on the incidence matrices of oval designs. The new LDPC codes have regular parity-check matrices and Tanner graphs free of 4-cycles. Like the finite geometry codes, the codes from oval designs have parity-check matrices with a large proportion of linearly dependent rows and can achieve significantly better minimum...
متن کاملA Class of High-rate, Low-complexity, Well- structured LDPC Codes from Combinatorial Designs and their Applications on ISI Channels
We present a systematic construction of a class of highrate, well-structured low density parity check (LDPC) codes based on combinatorial designs. We show that the proposed -design results in a class of -regular LDPC codes, which are systematic, quasicyclic, free of length-4 and length-6 cycles, linear-time encodable and decodable, and which have high code rates of . Analysis from the maximum l...
متن کاملResolvable 2-designs for regular low-density parity-check codes
This paper extends the class of low-density paritycheck (LDPC) codes that can be algebraically constructed. We present regular LDPC codes based on resolvable Steiner 2-designs which have Tanner graphs free of four-cycles. The resulting codes are -regular or -regular for any value of and for a flexible choice of code lengths.
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملConstruction of low-density parity-check codes from Kirkman triple systems
Gallager introduced LDPC codes in 1962, presenting a construction method to randomly allocate bits in a sparse parity-check matrix subject to constraints on the row and column weights. Since then improvements have been made to Gallager’s construction method and some analytic constructions for LDPC codes have recently been presented. However, analytically constructed LDPC codes comprise only a v...
متن کامل